Marine Applications of the Fast Marching Method
نویسندگان
چکیده
منابع مشابه
Implementation of the Fast Marching Method
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N logN) time, where the factor logN is due to the administration of a priority queue. Recently, [YBS06] have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error in...
متن کاملSegmentation Using Fast Marching Method
The paper deals with a novel segmentation technique applicable to colour video sequences. The algorithm uses Fast Marching Method for automatic extraction of semantic objects from natural colour video sequences by joint motion and colour analysis. The algorithm handles background in the same way as other objects, thus it does not need global motion compensation. The number of control parameters...
متن کاملIntroduction to the Fast Marching Method
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has been first introduced to find numerical approximations of the solutions to the stationary eikonal equation. More generally we show that this method allows to find exactly the solutions of numerical schemes that satisfy a certain causality assumption. In order to motivate this method, we present t...
متن کاملCurve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Sethian’s Fast Marching Method to find the solution with sub-resolution accuracy and in consistence with the underlying continuous problem. We demonstrate how the method may be applied to compare closed curves, morph one ...
متن کاملComparison of the Parallel Fast Marching Method, the Fast Iterative Method, and the Parallel Semi-Ordered Fast Iterative Method
Solving the eikonal equation allows to compute a monotone front propagation of anisotropic nature and is thus a widely applied technique in different areas of science and engineering. Various methods are available out of which only a subset is suitable for shared-memory parallelization, which is the key focus of this analysis. We evaluate three different approaches, those being the recently dev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Robotics and AI
سال: 2020
ISSN: 2296-9144
DOI: 10.3389/frobt.2020.00002